Computational complexity - PDFSEARCH.IO - Document Search Engine

Computational complexity
Results: 2253

#	Item
171	Approximability Results for the p-Center Problem Stefan Buettcher Course Project Algorithm Design and Analysis Add to Reading List Source URL: stefan.buettcher.org Language: English - Date: 2004-09-19 21:38:52 Computational complexity theory Theory of computation Mathematics NP-complete problems Set cover problem NP Dominating set Approximation algorithm Metric k-center Optimization problem Reduction P versus NP problem
172	What makes the Arc-Preserving Subsequence problem hard?⋆ Guillaume Blin1 , Guillaume Fertin1 , Romeo Rizzi2 , and St´ephane Vialette3 1 2 Add to Reading List Source URL: pagesperso.lina.univ-nantes.fr Language: English - Date: 2009-07-03 08:56:58 Computational complexity theory Complexity classes Theory of computation NP P Reduction Time complexity
173	May 19, Spring 2011 Final Exam Introduction to Algorithms Massachusetts Institute of Technology Add to Reading List Source URL: courses.csail.mit.edu Language: English - Date: 2011-05-20 09:47:26 Mathematics Computational complexity theory Mathematical analysis Analysis of algorithms Operations research Mathematical notation Asymptotic analysis Dynamic programming Big O notation Time complexity Recurrence relation Knapsack problem
174	Improved Parallel Integer Sorting without Concurrent Writing Susanne Albersyz Torben Hagerupy Add to Reading List Source URL: www14.in.tum.de Language: English - Date: 2013-11-25 11:07:42 Sorting algorithms Mathematics Order theory Theory of computation Radix sort Bitonic sorter Time complexity Merge sort Integer sorting Computational complexity theory Algorithm Big O notation
175	Early-Deciding Consensus is Expensive Danny Dolev Christoph Lenzen Hebrew University of Jerusalem Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2015-05-29 10:12:04 Computing Computational complexity theory Fault-tolerant computer systems Knowledge representation Consensus Distributed computing Tree Randomized algorithm Computer programming
176	The International Olympiad in Informatics Syllabus 1 Version and status information Add to Reading List Source URL: ioinformatics.org Language: English - Date: 2013-10-04 02:55:48 Computer programming Software engineering Mathematics Recursion Theoretical computer science Operations research Computability theory International Olympiad in Informatics International Science Olympiad Algorithm Sorting algorithm Computational complexity theory
177	Approximating the least hypervolume contributor: NP-hard in general, but fast in practice Karl Bringmann1 and Tobias Friedrich2 1 Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2016-01-03 06:44:56 Computational complexity theory Theory of computation Complexity classes Approximation algorithms Computational hardness assumptions Polynomial-time approximation scheme Time complexity NC Reduction Exponential time hypothesis NP-hardness NP
178	The Complexity of Computing the Solution Obtained by a Specific Algorithm Paul W. Goldberg Department of Computer Science University of Oxford, U. K. Add to Reading List Source URL: www.maths.lse.ac.uk Language: English - Date: 2013-10-30 13:41:09 Computational complexity theory Complexity classes Theory of computation PPAD Reduction LemkeHowson algorithm Algorithm NP PSPACE-complete P True quantified Boolean formula
179	Approximating the volume of unions and intersections of high-dimensional geometric objects Karl Bringmann1 and Tobias Friedrich2,3 1 Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2016-01-03 06:44:42 Computational complexity theory Theory of computation Complexity classes Polynomial-time approximation scheme BPP Time complexity NP NC
180	ALGORITHMIC LINEAR DIMENSION REDUCTION IN THE `1 NORM FOR SPARSE VECTORS A. C. GILBERT, M. J. STRAUSS, J. A. TROPP, AND R. VERSHYNIN Abstract. We can recover approximately a sparse signal with limited noise, i.e, a vecto Add to Reading List Source URL: users.cms.caltech.edu Language: English - Date: 2009-02-03 14:30:47 Digital signal processing Computational complexity theory Matrix Fast Fourier transform Time complexity Mathematics Computer science Theoretical computer science Polynomials

UPDATE